Polynomiography via an iterative method corresponding to Simpsons 13 rule

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Invitation to Polynomiography via Exponential Series

The subject of Polynomiography deals with algorithmic visualization of polynomial equations, having many applications in STEM and art, see [8]-[12]. Here we consider the polynomiography of the partial sums of the exponential series. While the exponential function is taught in standard calculus courses, it is unlikely that properties of zeros of its partial sums are considered in such courses, l...

متن کامل

An Iterative Decision Rule to minimize cost of Acceptance Sampling Plan in Machine Replacement Problem

In this paper, we presented an optimal iterative decision rule for minimizing total cost in designing a sampling plan for machine replacement problem using the approach of dynamic programming and Bayesian inferences. Cost of replacing the machine and cost of defectives produced by machine has been considered in model. Concept of control threshold policy has been applied for decision making. If ...

متن کامل

OPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD

In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of th...

متن کامل

OPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD

In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of the ...

متن کامل

Rule Optimization via Sg·trunc Method

Most inductive learning systems generate complete and consistent descriptions. In order to achieve completeness and consistency in the presence of noise or imprecision. one may generate overly complex and detailed descriptions. Such descriptions. however. may not perform well in future cases and suffer the disadvantage of excessive complexity. This is th~ well known phenomenon of overfining, In...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Nonlinear Sciences and Applications

سال: 2016

ISSN: 2008-1901

DOI: 10.22436/jnsa.009.03.25